for _ in range(int(input())):
n = int(input())
print((n * (n + 1) * (2 * n + 1) // 3 - n * (n + 1) // 2) * 2022% 1000000007 )
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
int MOD = 1e9 + 7;
#define MAX 200005
// find_by_order()
// order_of_key()
// store duplicates set int to pair<int, int>
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
PBDS;
bool cmp(pair<int, int> a, pair<int, int> b){
return a.first < b.first;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t;
cin >> t;
while(t--){
int n;
cin >> n;
int ans=((((n * (n+1)) % MOD) * ((4*n)-1)) % MOD * 337) % MOD;
cout << ans << endl;
}
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |